INTUITIONISTIC SAHLQVIST THEORY FOR DEDUCTIVE SYSTEMS
نویسندگان
چکیده
Abstract Sahlqvist theory is extended to the fragments of intuitionistic propositional calculus that include conjunction connective. This allows us introduce a character amenable arbitrary protoalgebraic deductive systems. As an application, we obtain theorem for implication connective and extensions linear logic.
منابع مشابه
Implementing the Meta-Theory of Deductive Systems
We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an operational semantics in the spirit of logic programming. It is based on the mechanical verification of properties of transformations between deductions, which relies on type reconstruction and schema-checking. The latter is justi...
متن کاملSahlqvist Theory for Hybrid Logics (Unified Correspondence IV)
Hybrid logics extends modal logic with a special sort of variables, called nominals, which are evaluated to singletons in Kripke models by valuations, thus acting as names for states in models, see e.g., [1], [2] and [7]. Various other connectives which capitalize on this naming power of the nominals and, in so doing, enhance the expressive power of these languages even further, can be included...
متن کاملchannel estimation for mimo-ofdm systems
تخمین دقیق مشخصات کانال در سیستم های مخابراتی یک امر مهم محسوب می گردد. این امر به ویژه در کانال های بیسیم با خاصیت فرکانس گزینی و زمان گزینی شدید، چالش بزرگی است. مقالات متعدد پر از روش های مبتکرانه ای برای طراحی و آنالیز الگوریتم های تخمین کانال است که بیشتر آنها از روش های خاصی استفاده می کنند که یا دارای عملکرد خوب با پیچیدگی محاسباتی بالا هستند و یا با عملکرد نه چندان خوب پیچیدگی پایینی...
Minimal Deductive Systems for RDF
This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler language which preserves the original semantics. This approach is beneficial in at least two directions: (a) To have a simple abstract fragment of RDFS easy to formalize and to reason about, which captures the essence of RDFS; (b) ...
متن کاملIntuitionistic Deductive Databases and the Polynomial Time Hierarchy
Deductive databases are poor at tasks such as planning and design, where one must explore the consequences of hypothetical actions and possibilities. To address this limitation, we have developed a deductive database language in which a user can create hypotheses and draw inferences from them. In earlier work, we established initial results on the complexity and expressibility of this language....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2023
ISSN: ['1943-5886', '0022-4812']
DOI: https://doi.org/10.1017/jsl.2023.7